<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<html>
  <head>
    <meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
      <title>GTL - Graph Template Library: Class List</title>
      <link href="doxygen.css" rel="stylesheet" type="text/css">
  </head>
  <body>
    <p class="links">  
      <a href="../index.html">Home</a> |
      Documentation |
      <a href="../register.html">Download</a> |
      <a href="../platforms.html">Platforms</a> |
      <a href="../refer.html">Projects</a> |      
      <a href="../lists.html">Mailing Lists</a> |
      <a href="../history.html">Version History</a>
    </p>

<!-- Generated by Doxygen 1.5.3 -->
<div class="tabs">
  <ul>
    <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    <li class="current"><a href="classes.html"><span>Classes</span></a></li>
    <li><a href="files.html"><span>Files</span></a></li>
    <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
  </ul>
</div>
<div class="tabs">
  <ul>
    <li><a href="classes.html"><span>Alphabetical&nbsp;List</span></a></li>
    <li class="current"><a href="annotated.html"><span>Class&nbsp;List</span></a></li>
    <li><a href="hierarchy.html"><span>Class&nbsp;Hierarchy</span></a></li>
    <li><a href="functions.html"><span>Class&nbsp;Members</span></a></li>
  </ul>
</div>
<h1>GTL - Graph Template Library Class List</h1>Here are the classes, structs, unions and interfaces with brief descriptions:<table>
  <tr><td class="indexkey"><a class="el" href="a00001.html">algorithm</a></td><td class="indexvalue">Abstract baseclass for all algoritm-classes </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00002.html">bellman_ford</a></td><td class="indexvalue">Bellman Ford algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00003.html">bfs</a></td><td class="indexvalue">Breadth-First-Search (BFS) algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00004.html">biconnectivity</a></td><td class="indexvalue">Biconnectivity-test and low-numbers </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00005.html">bid_dijkstra</a></td><td class="indexvalue">Dijkstra's Algorithm for computing a shortest path from a single source to a single target </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00006.html">bin_heap&lt; T, Pred &gt;</a></td><td class="indexvalue">Binary heap </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00007.html">components</a></td><td class="indexvalue">Connected <a class="el" href="a00007.html" title="Connected components algorithm.">components</a> <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00008.html">dfs</a></td><td class="indexvalue">Depth-First-Search (DFS) algorithm </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00009.html">dijkstra</a></td><td class="indexvalue">Dijkstra's Algorithm for computing single source shortest path </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00010.html">edge</a></td><td class="indexvalue">An <a class="el" href="a00010.html" title="An edge in a graph.">edge</a> in a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00011.html">edge_map&lt; T, Alloc &gt;</a></td><td class="indexvalue">A specialized map with edges as keys </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00012.html">fm_partition</a></td><td class="indexvalue">Heuristic <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> bi-partitioning <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Fiduccia-Mattheyses) </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00013.html">GML_error</a></td><td class="indexvalue">Reason and position of an error in a GML file </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00014.html">graph</a></td><td class="indexvalue">A directed or undirected <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00015.html">maxflow_ff</a></td><td class="indexvalue">Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Edmonds-Karp) </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00016.html">maxflow_pp</a></td><td class="indexvalue">Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Malhotra, Kumar, Maheshwari) </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00017.html">maxflow_sap</a></td><td class="indexvalue">Maximum flow <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> with shortest augmenting paths </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00018.html">min_tree</a></td><td class="indexvalue">Kruskal's algorithm for finding minimal spanning tree of a graph </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00019.html">ne_map&lt; Key, Value, Graph, Alloc &gt;</a></td><td class="indexvalue">Baseclass for <a class="el" href="a00021.html" title="A specialized map with nodes as keys.">node_map</a> and <a class="el" href="a00011.html" title="A specialized map with edges as keys.">edge_map</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00020.html">node</a></td><td class="indexvalue">A <a class="el" href="a00020.html" title="A node in a graph.">node</a> in a <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00021.html">node_map&lt; T, Alloc &gt;</a></td><td class="indexvalue">A specialized map with nodes as keys </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00022.html">planar_embedding</a></td><td class="indexvalue">Ordered adjacency lists as a result of <a class="el" href="a00023.html" title="Tests if a graph can be drawn on a plane without any edge crossings.">planarity</a> testing </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00023.html">planarity</a></td><td class="indexvalue">Tests if a graph can be drawn on a plane without any edge crossings </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00024.html">pq_tree</a></td><td class="indexvalue">PQ-Trees </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00025.html">ratio_cut_partition</a></td><td class="indexvalue">Heuristic <a class="el" href="a00014.html" title="A directed or undirected graph.">graph</a> bi-partitioning <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> (Wei-Cheng) </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00026.html">st_number</a></td><td class="indexvalue">ST-number <a class="el" href="a00001.html" title="Abstract baseclass for all algoritm-classes.">algorithm</a> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00027.html">symlist&lt; T &gt;</a></td><td class="indexvalue">List which can be reversed in <img class="formulaInl" alt="$\mathcal{O}(1)$" src="form_7.png"> </td></tr>
  <tr><td class="indexkey"><a class="el" href="a00028.html">topsort</a></td><td class="indexvalue">Topological sorting </td></tr>
</table>
    <p class="links">
      <a href="http://www.uni-passau.de/">University of Passau</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/">FMI</a>
      &nbsp;-&nbsp;
      <a href="http://www.fmi.uni-passau.de/fmi/lehrstuehle/brandenburg/">Theoretical
	Computer Science</a>
    </p>
  <div class="copyright">
      Design &copy; 2002, 2003 <a href="mailto:raitner@fmi.uni-passau.de">Marcus Raitner</a>,  University of Passau 
  </div>
</body>
</html>
